Determining communications charging

ABSTRACT

A system for determining a communication charge comprising a charging equation determiner, an inflection point determiner, and a charge determiner. The charging equation determiner for determining a charging equation based at least in part on a normalized set of inputs. The inflection point determiner for determining an inflection point based at least in part on a charging structure database. The charge determiner for determining a communication charge based at least in part on the charging equation and the inflection point.

CROSS REFERENCE TO OTHER APPLICATIONS

This application is a continuation of co-pending U.S. patent applicationSer. No. 14/020,094, entitled DETERMINING COMMUNICATIONS CHARGING filedSep. 6, 2013 which is incorporated herein by reference for all purposes,which is a continuation of U.S. patent application Ser. No. 13/206,421,now U.S. Pat. No. 8,553,862, entitled DETERMINING COMMUNICATIONSCHARGING filed Aug. 9, 2011 which is incorporated herein by referencefor all purposes, which claims priority to U.S. Provisional ApplicationNo. 61/372,157, entitled DETERMINING CALL CHARGING filed Aug. 10, 2010which is incorporated herein by reference for all purposes.

BACKGROUND OF THE INVENTION

Determining a charge or cost for communications (e.g., a call or datatraffic) is complex and time consuming. Often the charge depends onmultiple factors including communication time, communication date,communication rate plan, balance levels, the parties being communicatedwith, etc. Typically, the multiple input factors are all evaluatedserially to determine the charging rate. Also, the rates do notnecessarily remain the same during the communication (e.g., a call ordata transfer) meaning that they need to be determined again as thefactors influencing the charging rate change (e.g., call straddles adaytime/nighttime boundary, a balance level—for example, a total numberof minutes or bytes). Since the determination of a charge or potentialcharge is typically performed several times for each communication(e.g., for initial authorization, at times during the communication, andat the end of the communication for determining the communication cost),charge determination represents a significant computational burden for acommunication service provider and can be a rate limiting step for itsability to handle communication volume.

BRIEF DESCRIPTION OF THE DRAWINGS

Various embodiments of the invention are disclosed in the followingdetailed description and the accompanying drawings.

FIG. 1 is a block diagram illustrating an embodiment of a network systemincluding optimized operations for a charging system architecture.

FIG. 2 is a block diagram illustrating an embodiment of a chargingserver.

FIG. 3 is a block diagram illustrating an embodiment of a chargingequation determiner.

FIG. 4 is a block diagram illustrating an embodiment of an inputnormalizer.

FIG. 5 is a flow diagram illustrating an embodiment of a process formanaging and accounting for a connection on a network.

FIG. 6 is a flow diagram illustrating a process for making a connection.

FIG. 7 is a flow diagram illustrating an embodiment of a process fordetermining a charging equation.

FIG. 8 is a flow diagram illustrating an embodiment of a process forconducting accounting.

FIG. 9 is a flow diagram illustrating an embodiment of a process fordetermining the next inflection point.

FIG. 10 is a table illustrating an embodiment of a charge determination.

FIG. 11 is a graph illustrating an embodiment of a rating result.

FIG. 12 is a graph illustrating an embodiment of balance values.

DETAILED DESCRIPTION

The invention can be implemented in numerous ways, including as aprocess; an apparatus; a system; a composition of matter; a computerprogram product embodied on a computer readable storage medium; and/or aprocessor, such as a processor configured to execute instructions storedon and/or provided by a memory coupled to the processor. In thisspecification, these implementations, or any other form that theinvention may take, may be referred to as techniques. In general, theorder of the steps of disclosed processes may be altered within thescope of the invention. Unless stated otherwise, a component such as aprocessor or a memory described as being configured to perform a taskmay be implemented as a general component that is temporarily configuredto perform the task at a given time or a specific component that ismanufactured to perform the task. As used herein, the term ‘processor’refers to one or more devices, circuits, and/or processing coresconfigured to process data, such as computer program instructions.

A detailed description of one or more embodiments of the invention isprovided below along with accompanying figures that illustrate theprinciples of the invention. The invention is described in connectionwith such embodiments, but the invention is not limited to anyembodiment. The scope of the invention is limited only by the claims andthe invention encompasses numerous alternatives, modifications andequivalents. Numerous specific details are set forth in the followingdescription in order to provide a thorough understanding of theinvention. These details are provided for the purpose of example and theinvention may be practiced according to the claims without some or allof these specific details. For the purpose of clarity, technicalmaterial that is known in the technical fields related to the inventionhas not been described in detail so that the invention is notunnecessarily obscured.

A system for determining a communication charge comprising a chargingequation determiner, an inflection point determiner, and a chargedeterminer. The charging equation determiner for determining a chargingequation based at least in part on a normalized set of inputs. Theinflection point determiner for determining an inflection point based atleast in part on a charging structure database. The charge determinerfor determining a communication charge based at least in part on thecharging equation and the inflection point.

In some embodiments, the system for determining a communication chargecomprises a processor and a memory. The processor is configured to: 1)determining a charging equation based at least in part on a normalizedset of inputs, 2) determining an inflection point based at least in parton a charging structure database, and 3) determining a communicationcharge based at least in part on the charging equation and theinflection point. The memory is coupled to the processor and configuredto provide the processor with instructions.

The charging system handles authorization (e.g., can I call? how longcan I call? How much data can I transfer? etc.), reauthorization (e.g.,can I keep talking or downloading? Is there a policy limit to calls ordata transfers? etc.), and final accounting of a connection betweenusers over a network. The charging system provides a quantity approved(e.g., minutes, text messages, bytes, etc.); and/or a balance impact(e.g., a charge towards an account balance, in some cases used toreserve the charge amount out of the balance available to a user);and/or a price impact (e.g., the amount of minutes or dollars that anaccount balance is to be changed). In some embodiments, a request ofdetermining a charge is received after the communication and for thesecommunication charges there is no authorization or reauthorization.During the processes of authorization and reauthorization of each userconnecting to the network and communicating, the charging systemreceives a set of inputs, including system status inputs, user datainputs, and any other appropriate inputs. The inputs are used by thecharging system to determine the current charging state of the user andthe connection along one or more parameters (e.g., daytime/nighttimerate, rate plan type, promotional discount in effect, free minutes, planminutes, rollover minutes, byte costs, base byte rate, run on byte rate,etc.). The set of parameters are known as normalized inputs, and eachcan take on one of a predetermined number of values (e.g., a day timerate and a night time rate; a peak rate, an off peak rate, a lunch timerate, and a weekend rate; etc.). After the set of normalized inputs hasbeen determined, it is used to look up an entry in a multidimensionalmatrix, where the number of dimensions in the matrix is the same as thenumber of normalized inputs. The entry in the matrix contains a chargingequation, used to determine how the user's account balance or balanceschange during the connection. In some embodiments, the charging equationis determined by building a compound charging equation from a number ofsimpler charging equations (e.g., a linear superposition of equations).

After a charging equation has been determined, it is applied to a testbalance or balances to determine for how long it is valid (e.g., atime/condition when a boundary arises to the validity of the equation isno longer valid). As time passes or as other parameter values/balancesare affected, account balances and other inputs to the charging systemcan change (e.g., minute balance remaining, dollar balance remaining,byte balances, etc.). Eventually, the change in the system inputs willcause a change in the normalized inputs (called an inflection point).For each of the normalized inputs, the duration or condition until achange occurs can be determined. The system determines the minimum timeor the boundary condition until any of the set of normalized inputschanges; this is the duration or the boundary condition for which thecharging equation is valid. The system must perform a reauthorizationprocess when the charging equation(s) become(s) invalid in order todetermine the new charging equation. In some embodiments, multiplecharging equation segments are known (e.g., where a segment comprises asection between inflection points when a charging equation(s) isvalid)—for example, in the event that the a charging rate is known, thetime for charging rate change is known, and the charging rate thatbecomes valid after the change is known, then the charging rate can befully predicted across the boundary without a reauthorization. Forexample, in the case where the rate plan charges $0.20/minute duringpeak hours and $0.10/minute during off-peak hours, a request toauthorize a 20 minute call that begins 10 minutes before the switch frompeak hours to off-peak hours can be fully authorized because bothcharging equations and the inflection point between them can becalculated in advance. In various embodiments, the boundary condition isnot easy to predict because the inflection point depends upon an unknownvariable, the inflection point is a moment in time but the chargingequation is not time-based, or any other appropriate factor making thecharging inflection point difficult to predict.

A communication system (e.g., a cellular telephone communication systemor a cellular data communication system) comprises a large number ofusers and one or more server systems, all connected to a network. Theusers communicate with each other and the server system(s) via thenetwork. The server system(s) manage connection and disconnection of theusers to the network, and track accounting of the users' activities.When a user makes a connection to the network, a server authorizes theuser's accounting on the network, verifying that the user is allowed toconnect. Periodically during the connection, a server reauthorizes theuser on the network, verifying that the user is allowed to stayconnected. When a user disconnects from the network or completes aspecific communication over the network, a server calculates the finalaccounting for the connection. Charging rates can depend on many things,including time of day, day of the week, location of the user, the user'srate plan, who the user is connecting to, any special or promotionalconnection rates in effect for the connection, and many other factors.Each conditional factor complicates the processes of authorization,reauthorization, and final accounting. When a large number of users aremaking connections to the network, a server may have many pendingauthorization requests, increasing each user's time to successfully makeits connection as the server works through its queue. Minimizing time tocomplete the processes of authorization, reauthorization, and finalaccounting is thus crucial to maintaining a high performance network.The charging system disclosed provides a rapid and efficient manner ofdetermining a call charge. Linear equation(s) for the charging rateis/are determined and can be collapsed to a single charging equation.Boundaries with respect to changing input variables (e.g., time,dollars, bytes, etc.) are determined so that it is known when the singlecharging equation is applicable and when the equation needs to beredetermined. In some embodiments, the input variables are allnormalized to become indices for identifying the one or more linearequations used to determine the single charging equation by looking thelinear equations up in a large lookup table/matrix/database using theindices.

In various embodiments, the process is abbreviated—for example,authorization and/or reauthorization are not performed, or any otherappropriate combination of tasks for the process. In some embodiments,the transaction has already occurred and a charge is determined afterthe use of the service has been finished (e.g., a call is over, a numberof bytes transferred, etc.).

In addition, other policy management decision-making processes outsideof the area of charging systems can use a determiner similar to theequation determiner. Any kind of input can be used for the policymanagement decision-making system, as long as an input normalizer can bebuilt for creating a normalized input that reflects the information inthe input as it relates to the decision-making process. Once a set ofinputs has been converted into a set of normalized inputs, the set ofnormalized inputs is used to locate an entry in a matrix of relevantpolicy management decisions. The located decision is output by thesystem as the response to the inputs.

In some embodiments, the normalizer has dynamic input, which requiresthat inflection points be updated to adjust for the dynamic inputs. Forexample, in the case of a rate plan that offers discounts as more datais downloaded (e.g. 10% discount once 10 Mb has been downloaded, 20%discount once 50 Mb has been downloaded), a balance must be maintainedthat dynamically tracks the amount of data downloaded. While a downloadis still occurring, this balance may cross a defined threshold (10 Mb or50 Mb in this example) and the normalized input derived from the balancewill dynamically change, causing an inflection point and aredetermination of the charging equation(s).

FIG. 1 is a block diagram illustrating an embodiment of a network systemincluding optimized operations for a charging system architecture. Inthe example shown, the network system includes network users 100 and108. In various embodiments, the network system includes 3, 5, 26, 100,10, 250, or any other appropriate number of network users. The networkusers communicate with network 102 via a communications device. Invarious embodiments, the communications device is a cellularcommunications device, a radio frequency communications device, a wiredcommunications device, an optical communications device, or any otherappropriate kind of communications device. Network 102 comprises one ormore of the following: a cellular network, a local area network, a widearea network, a wired network, a wireless network, the Internet, a fibernetwork, or any other appropriate network enabling communication.Charging server 104 additionally communicates with network 102. Chargingserver 104 tracks communications between multiple network users (e.g.,network users 100 and 108) for the purpose of charging them for theirusage. In some embodiments, charging server 104 additionally verifiesthat a network user is allowed to use the network and authorizes them tomake a connection. In some embodiments, charging server 104 additionallyverifies that a network user is allowed to continue using the networkand reauthorizes them to continue their connection. The functionality ofcharging server 104 is programmed into charging software, which isstored on and executed by charging server 104. Charging softwareimplements optimized operations for a charging system architecture.

FIG. 2 is a block diagram illustrating an embodiment of a chargingserver. In some embodiments, charging server 200 is used to implementcharging server 104 of FIG. 1. In the example shown, status system 202,charging structure database 204, event input handler 212, and userdatabase 206 provide input data to charging equation determiner 208.Event input handler 212 receives a request to determine whether acommunication should be authorized, reauthorized, or to determine a costfor the communication. Event information is provided to event inputhandler 212—for example, type of request, user identifier, callidentifier, quantity requested, etc. Received event information is usedto identify charging structure data, status information, and/or userdata needed for authorizing, reauthorizing, or pricing a call, or anyother appropriate action performed by the charging server. In someembodiments, charging server 200 additionally comprises any otherappropriate inputs to charging equation determiner 208. In variousembodiments, status system 202 provides date and time, system load,promotional rate, or any other appropriate system status messages. Invarious embodiments, charging structure database 204 provides user rateplan structures, group rate plan structures, promotional offers, or anyother appropriate charging structure data. For example, chargingstructure data includes charging rates during peak times, during offpeak times, during holiday times, during day times, during night times,during weekend times, for long distance calls and international calls,for calls to friends, for calls to mobile callers inside a network, forcalls to family members, for calls on a birthday, for communicationswithin a zone, for calls to fellow employees, byte rates, etc. Invarious embodiments, user database 206 provides a user's name, accountnumber, SIM code, rate plan, plan group name, account balances,associated group account balances, remaining connection time, associatedgroup remaining connection time, policy parameters, device capabilities,friends and family lists, special days such as birthday, timezone andlocation information, or any other appropriate user data. Chargingstructure database 204 provides inflection point information. Inflectionpoints define the end points for segments in which a charging equationis valid. For example, for a call made starting at a time, chargingstructure database 204 stores information regarding the rate for thetime of the call start and the time for when the rate changes. The ratechange time determines an inflection point. In various embodiments, theinflection point is defined by a rate change, is defined by a ratechange time, is defined by a balance value (e.g., a time, a number ofminutes, a data volume, a number of bytes, etc.), is defined by abalance range, or any other appropriate definition for an inflectionpoint. In some embodiments, user database 206 provides information tocharging server 200 via a network (e.g., network 102 of FIG. 1). In someembodiments, the inputs to charging equation determiner 208 aredesignated as either static or dynamic. Inputs to charging equationdeterminer 208 marked as static are those that will never change overthe course of a connection (e.g., user's name, IP address of user orserver, etc.). Inputs to charging equation determiner 208 marked asdynamic are those that can change over the course of a connection (e.g.,current time, user's account balance, etc.). In some embodiments, inputsto charging equation determiner 208 marked as static are not received bycharging equation determiner 208 during a reauthorization process.

Charging equation determiner 208 processes the inputs provided by statussystem 202, charging structure database 204, event input handler 212,and user database 206, and outputs a charging equation to chargedeterminer 210. The charging equation comprises a rate (e.g., a slope)and a fixed amount used to determine impact to a balance (e.g., U.S.dollars, time in minutes, bytes sent/received, number of text messages,etc.). The charge equation is linear algebra, so it takes the form“y=a+bx” where x is the quantity being rated, “a” and “b” are constants.The “a” is referred to as the “fixed amount” and is applied immediatelyand independent of the value of x, while “b” is the variable amount andis applied as a slope over x. This lets you create rate plans such as“10 cents to place a call, plus 5 cents/minute”, where 10 cents would bethe fixed amount and the 5 cents/minute would be the variable amount.

In some embodiments, charging structure database 204 is provided only tocharging equation determiner 208 during system initialization, and isstored from then on. Charging equation determiner 208 implementsoptimized operations for a charging system architecture. In someembodiments, charging equation determiner 208 operates as part of anetwork user's (e.g., network user 100 of FIG. 1) authorization orreauthorization process. Charge determiner 210 receives a chargingequation and modifies data stored in user database 206 according to thecharging equation. In various embodiments, charging equation determinesa charge based on a time passing or a number of bytes transferred or anyother appropriate quantity change. In various embodiments, there are twoapproaches to managing the account balances while a session isactive—“timer based” and “reservation based”. Traditional SS7 networksuse timers, data oriented systems use reservations because there is nodeterministic link between time and the amount of data consumed. In someembodiments, in a timer-based solution, the balances are updated as timepasses. This requires the session to be rated based on duration, so thepassage of time determines the cost. In a reservation-based solution,this assumption is not made, so these systems apply both when time isthe rated quantity and when it is not. In this model, the chargingserver updates a user's balances (either as reservations or actualcharges) every time it receives notification from the network. For anauthorization, the total cost of however much usage was authorized tothe network is reserved, since the network will not come back until thatis used up so it is necessary to ensure the ability to pay for thatusage is maintained. For a reauthorization, the system can either addthe cost of the newly authorized amount to the balance reservations, orit can charge for the amount that's actually been used so far, therebydropping the original reservation and replacing with a charge, then do areservation for the cost of the newly authorized usage. At session close(final charge calculation), all reservations are dropped and anyuncharged usage is charged for. In some embodiments, the balances arenot updated just by the passage of time, they are updated at theseinteraction points. In some embodiments, balances are not updated withreservations, and are only updated with final charges.

In various embodiments, charging server 200 comprises one or moreprocessors, one or more memory units (e.g., solid state memory,integrated circuit memory, magnetic hard drive memory, redundant arrayof discs memory, etc.), field programmable gate arrays, custom processorintegrated circuits, software modules running on general purposeprocessors or specialized processors (e.g., math co-processors),hardware, or any other appropriate combination of hardware or software.

FIG. 3 is a block diagram illustrating an embodiment of a chargingequation determiner. In some embodiments, charging equation determiner300 is used to implement charging equation determiner 208 of FIG. 2. Inthe example shown, charging equation determiner 300 comprises inputnormalizer 302 and charging equation identifier 304. Input normalizer302 receives N inputs and produces M normalized inputs. In variousembodiments, the N inputs comprise system status inputs, userinformation inputs, stored data inputs, or any other appropriate inputs.The N inputs are of arbitrary types and values, including integers,fractional numbers, strings, dates, phone numbers, IP addresses, GPSlocation codes, or any other reasonable type and value. The normalizerreduces this arbitrarily large value space into a much smallernormalized space, where each possible value for a normalized input isbased on the values required by any given rate plan. For example, a timenormalizer for one rate plan may take all the seconds in a week andnormalize them into one of two values—peak or off-peak (or a numericrepresentation of these values). Another time normalizer, for a morecomplex rate plan, may take all the seconds in a week and normalize theminto one of four values—peak, off-peak, lunch hour or weekend (or anumeric representation of these values). A balance normalizer that isused to trigger a discount once 100 Mb has been downloaded may normalizethe value of the balance tracking downloaded quantity from any possiblevalue into one of two values—“below 100 Mb” and “at/above 100 Mb” (or anumeric representation of these values). In various embodiments, N(e.g., the number of inputs) is greater than M (e.g., the number ofnormalized inputs), N is less than M, or N is equal to M. In variousembodiments, each normalized input takes on an integer value from 1 to apredetermined maximum value, each normalized input is a specifiedstring, or any other unique representation of the possible normalizedinput values. In some embodiments, the possible values for the Mdifferent normalized inputs are different from one another. In someembodiments, the values determined for the M normalized inputs aredetermined entirely from the N inputs (e.g., there are no other inputsor stored internal states that are used to determine the M normalizedinputs). For any given charging parameter that has an effect on thecharging equation (e.g., daytime/nighttime, user's rate plan, basic planminutes/overtime minutes, byte transfer rate cost, etc.) there is anassociated normalized input that represents the current state of thecharging parameter. In some embodiments, the M normalized inputs areused to locate or look up represent the charging equation indicated bythe N inputs. In some embodiments, a change in one or more of the Ninputs will not result in a change in any of the M normalized inputsunless it requires a change in the charging equation. Charging equationidentifier 304 locates and outputs a charging equation based on the Mnormalized inputs. In some embodiments, charging equation identifier 304locates a charging equation from a predetermined set of chargingequations. In some embodiments, charging equation identifier 304identifies the charging equation by using the M normalized inputs asindices into an M dimensional matrix of charging equations. In someembodiments, more than one charging equation is used (e.g., multiplebalances are modified during the connection), and charging equationidentifier 304 identifies and outputs the necessary number of chargingequations. In some embodiments, multiple charging equations are storedtogether in charging equation identifier 304 and are identified togetherusing a single lookup. In some embodiments, multiple copies of chargingequation identifier 304 are created and multiple charging equations areidentified separately from the separate charging equation identifiers.

In some embodiments, charging equation determiner 300 of FIG. 3 is usedas a general decision determiner for policy management decision-makingprocesses outside the area of charging systems. The set of N inputs toinput normalizer 302 can be any appropriate inputs for thedecision-making process. The set of M normalized inputs represent thedecision indicated by the N inputs, and a change in one or more of the Ninputs will not result in a change in any of the M normalized inputsunless it requires a change in the decision output. When chargingequation determiner 300 is used as a decision calculator, chargingequation identifier 304 is a decision identifier that identifies andoutputs a decision based on the M normalized inputs. In someembodiments, the decision identifier identifies the decision by usingthe M normalized inputs as indices into an M dimensional matrix ofdecisions.

FIG. 4 is a block diagram illustrating an embodiment of an inputnormalizer. In some embodiments, input normalizer 400 is used toimplement input normalizer 302 of FIG. 3. In the example shown, inputnormalizer 400 receives N inputs and produces M normalized inputs. Invarious embodiments, N (e.g., the number of inputs) is greater than M(e.g., the number of normalized inputs), N is less than M, or N is equalto M. Input normalizer 400 comprises normalizer 402, normalizer 404,normalizer 406, normalizer 408, and any other appropriate number ofnormalizers, for a total of M normalizers. In various embodiments, thereare 1, 2, 4, 10, 22, or any other appropriate number of normalizers.Each normalizer receives and processes a subset of the N inputs toproduce one normalized input. In various embodiments, each normalizerreceives one of the N inputs, each normalizer receives all of the Ninputs, some normalizers receive different subsets of the N inputs fromone another, or each normalizer receives any appropriate subset of the Ninputs. Each normalizer calculates a normalized input from the inputs itreceives using various analysis techniques including but not limited toone or more of the following: integer matching, balance range matching,date range matching, time range matching, string matching, string bestmatch, date matching, zone matching, calling group matching, or anyother appropriate data normalization technique. In some embodiments, ageneric set of data normalizers (e.g., a date matching normalizer, astring matching normalizer, an integer matching normalizer, etc.) areprogrammed and are later configured to apply to the specific chargingsituation (e.g., a normalizer to give a different charging rate on theuser's birthday, a normalizer to give a different charging rate when theuser is calling specific phone numbers or area codes, etc.). Forexample, there are three charging rates for calls in a day: daytime(e.g., 200/minute), evening (e.g., 100/minute), and nighttime (e.g.,50/minute); the input to a charging equation determiner is a moment intime. The normalizer takes as input the time of day (and possibly day ofweek, etc.) and produces as output one of the set of [daytime, evening,or nighttime]. The charging equation identifier has as input one of theset of [daytime, evening, or nighttime] and produces as output acharging equation—for example the charging equation includes the rate(e.g., one of the set of [200, 100, or 50] per minute). In someembodiments, each of the M normalizers is marked as static or dynamic. Anormalizer marked as static has only static inputs, and thus its outputcan never change over the course of the connection. A normalizer markedas dynamic has at least one dynamic input, and thus its output canchange over the course of the connection. In some embodiments,normalizers marked as static do not perform a calculation during areauthorization process and instead output a value stored from aprevious calculation. Once inputs have been received by input normalizer400, each normalizer operates independently to produce its normalizedinput. In some embodiments, the normalizers run in parallel in order toreduce latency from the receipt of the inputs to output of thenormalized inputs.

FIG. 5 is a flow diagram illustrating an embodiment of a process formanaging and accounting for a connection or communication on a network.In some embodiments, the process of FIG. 5 is executed by a chargingserver (e.g., charging server 104 of FIG. 1). In some embodiments, theprocess of FIG. 5 is used to manage and account for a network user(e.g., network user 100 of FIG. 1) making a connection on a network(e.g., network 102 of FIG. 1). In the example shown, in 500, aconnection request is received from a network user. In variousembodiments, the connection request is initiated by the network user,the connection request is in response to a request from a differentnetwork user, the connection request is part of an automated process, orthe connection request is made for any other appropriate reason. In 502,it is determined whether the connection is authorized. Authorizing theconnection comprises determining whether the network user (e.g., thenetwork user making a connection request in 500) is allowed to make aconnection to the network. In some embodiments, if the network user isallowed to make a connection to the network, authorizing the connectionadditionally comprises determining the current charging equation and/ordetermining the next charging equation inflection point. In the eventthat the connection is not authorized (e.g., the connectionauthorization process returns “Not Ok”), the process ends. In the eventthat the connection is authorized (e.g., the connection authorizationprocess returns “Ok”), control passes to 504.

In 504, it is determined whether there is a disconnect or a chargingequation inflection point. A disconnect can be received at any time. Invarious embodiments, a disconnect is received from a network user, adisconnect is received in response to a request from a different networkuser, a disconnect is received as a result of an automated process, or adisconnect is received for any other appropriate reason. In variousembodiments, a charging equation inflection point occurs at apredetermined time, a charging equation inflection point occurs at atime predetermined to be when external conditions cause the chargingequation to change, a charging equation inflection point occurs at amaximum time from the last connection authorization or reauthorization,a charging equation inflection point occurs when a balance hits a value(e.g., number of minutes hits a minute value, a number of bytestransferred hits a byte number value, etc.) is within a range of valuesor is greater than or less than a value, a charging equation inflectionpoint occurs when a rate of change of a balance is a value or is withina range of values or is greater than or less than a value, or any otherappropriate time for a charging equation inflection point. In someembodiments, while the process is waiting for a disconnect or a chargingequation inflection point, the user is charged for the connectionaccording to the current charging equation. In some embodiments, thecharges for the connection are computed by a charging determiner (e.g.,charging determiner 210 of FIG. 2). In the event that a chargingequation inflection point is reached, control passes to 506. In theevent that a disconnect is received, control passes to 508. In someembodiments, when the process begins waiting for a disconnect or acharging equation inflection point, charges for the connection (e.g.,charges for a call time, a number of bytes transferred, etc.) until thenext charging equation inflection point are reserved from the user'saccount balance(s). In the event that neither a disconnect is receivednor a charging equation inflection point is reached, then the systemwaits and control stays with 504. In some embodiments, the system canaccurately predict when an inflection point will be reached and thecharging equation that will become valid after the next inflectionpoint. Under these circumstances, the system may authorize multiplesegments of the connection in a single response, without having torecalculate at the next inflection point.

In 506, it is determined whether the connection is to be reauthorized.

Reauthorizing the connection comprises determining whether the networkuser (e.g., the network user making a connection request in 500) isstill allowed to maintain a connection to the network. In someembodiments, if the network user is still allowed to maintain aconnection to the network, reauthorizing the connection additionallycomprises determining a new charging equation and/or determining thenext charging equation inflection point. The new charging equation maybe the same or different than the previous charging equation. In theevent that the user is determined to not be allowed to connect (e.g.,the connection authorization process returns “Not Ok” or “No”), controlpasses to 508. In the event that the user is determined to be allowed toconnect (e.g., the connection authorization process returns “Ok” or“Yes”), the control passes to 504. In 508, accounting is conducted. Forexample, conducting accounting comprises determining the total charge tothe network user and modifying account balances accordingly.

As an example, let's say a user is connecting to a network to watch astreaming video. In this example, the user's rate plan specifies thatvideo data costs $0.20/Mb during peak hours (9:00 am-5:00 pm) and$0.10/Mb during off-peak hours (5:00 pm-9:00 am). In addition, this userhas pre-purchased 50 Mb of data transfer that can be applied at anytime. When the user connects and requests the video streaming, in 500 anauthorization request is received from the network. In 502, it iscalculated that an initial authorization of 50 Mb can be approvedbecause of the pre-purchased data for the user. This pre-purchased datais valid at any time, so the authorization to the network is specifiedonly with the limit that reauthorization must be requested once 50 Mbhas been streamed. When this inflection is reached, the network requestsreauthorization in 504. Let's say this reauthorization request isreceived at 8:15 am and at that time the user has $20 of availablecredit in their account. In 504, it is calculated that the user's creditallows an additional 200 Mb to be authorized, but this calculation isonly valid until 9:00 am when the charging rate changes. In 506, thecontinuation of the streaming video is authorized, but with twolimits—the streaming of an additional 200 Mb or reaching the time of9:00 am, whichever comes first. Let's say at 9:00 am the user hasstreamed an additional 100 Mb of data. The network again requests areauthorization, and notifies in 504 that as of 9:00 am an additional100 Mb were consumed. In 506, it is calculated that the cost of this 100Mb is $10, so the remaining credit available for the user is now $10.Given this credit, the user can stream an additional 50 Mb of data atthe peak rate, so in 506 again the reauthorization is approved, but withlimits of 50 Mb consumed or 5:00 pm, whichever comes first. Let's saythe video finishes streaming after 20 Mb of this last reauthorizationare consumed. The network notifies in 504 that the communication hascompleted (a disconnect). In 508, it is calculated that the total costfor the entire communication equals the 50 Mb of pre-purchased data plus$12, and the user's balances are charged accordingly.

FIG. 6 is a flow diagram illustrating a process for making a connection.In some embodiments, the process of FIG. 6 is used to implement 502 or506 of FIG. 5. In the example shown, in 600, inputs are received. Invarious embodiments, inputs comprise system status inputs, chargingstructure data inputs, user data inputs, or any other appropriateinputs. In some embodiments, charging structure data inputs are receivedand stored during system initialization, and are not received during anauthorization or reauthorization process. In some embodiments, during areauthorization process (e.g., 506 of FIG. 5) only inputs marked asdynamic inputs are received. In 602, it is determined whether aconnection is allowed to be made. In various embodiments, determiningwhether the user is allowed to make a connection comprises one or moreof the following: checking the user's charging plan, checking the user'sremaining duration of connection time, checking the user's accountbalance(s), checking the current date and/or time, or using any otherappropriate decision-making process. In the event that the user isdetermined to not be allowed to connect, control passes to 604. In 604,the process indicates “Not Ok,” and the process ends. In the event thatthe user is determined to be allowed to connect, control passes to 606.

In 606, a charging equation is determined. Optimized operations for acharging system architecture are used to determine the chargingequation. In some embodiments, a charging equation determiner (e.g.,charging equation determiner 300 of FIG. 3) is used to determine thecharging equation. Inputs received in 600 are used to determine thecharging equation. In some embodiments, when determining a chargingequation during a reauthorization process, only calculations based atleast partly on dynamic inputs are recalculated, and stored values ofcalculations based only on static inputs are used. In 608, the nextinflection point is determined. For example, a time or condition to thenext inflection point. In some embodiments, determining the time to thenext inflection point comprises determining the next time that thecharging equation will change under the conditions of charging accordingto the current charging equation. In some embodiments, if the time tothe next inflection point is determined to be greater than apredetermined threshold value, the predetermined threshold value is usedas the time to the next inflection point. In various embodiments, anumber of minutes to a next inflection point is determined or any otherappropriate quantity other than time is used to determine the nextinflection point. In some embodiments, an inflection point occurs when anumber of bytes has transferred. In 610, the process returns “Ok” andends.

FIG. 7 is a flow diagram illustrating an embodiment of a process fordetermining a charging equation. In some embodiments, the process ofFIG. 7 is used to implement 606 of FIG. 6. In the example shown, in 700,inputs are normalized. In some embodiments, inputs are normalized by aninput normalizer (e.g., input normalizer 400 of FIG. 4). Normalizinginputs comprises creating a set of normalized inputs from a received setof inputs (e.g., inputs received in 500 of FIG. 5). In 702, a chargingequation is located. In some embodiments, a charging equation is locatedby a charging equation identifier (e.g., charging equation identifier304 of FIG. 3). Identifying a charging equation comprises identifying acharging equation based on the set of normalized inputs. In someembodiments, identifying a charging equation comprises identifying acharging equation by using the set of normalized inputs as indices intoa matrix of charging equations.

In some embodiments, the process of FIG. 7 is used as a general decisioncalculation process for policy management decision-making processesoutside the area of charging systems. The inputs normalized in 700 canbe any appropriate inputs for the decision-making process. When theprocess of FIG. 7 is used as a decision calculation process, a decisionis identified in 702 based on the normalized inputs created in 700. Insome embodiments, the decision is identified by using the normalizedinputs as indices into a matrix of decisions.

FIG. 8 is a flow diagram illustrating an embodiment of a process forconducting accounting. In some embodiments, the process of FIG. 8 isused to implement 508 of FIG. 5. In the example shown, in 800, the totalcost of the connection is determined. In some embodiments, the totalcost of the connection is determined by summing the charges accrued overthe course of the call (e.g., the charges accrued while waiting in 504of FIG. 5). In some embodiments, the total cost of the connection isdetermined by a charging computer (e.g., charging computer 210 of FIG.2). In 802, balances are updated. Balances are updated to reflect thetotal cost of the connection determined in 800. In some embodiments,updating balances comprises modifying a user data (e.g., data in userdatabase 206 of FIG. 2).

FIG. 9 is a flow diagram illustrating an embodiment of a process fordetermining the next inflection point. In some embodiments, the processof FIG. 9 is used to implement 608 of FIG. 6. In the example shown, in900, a charging equation(s) and input(s) are received. In someembodiments, the charging equation or equations were determined by acharging equation determiner (e.g., charging equation determiner 300 ofFIG. 3). In some embodiments, the inputs were received at the beginningof an authorization or reauthorization process (e.g., process of FIG. 6for making a connection). In 902, a next inflection point is determinedby simulating until a normalized input changes. For example, for a givenset of current values (e.g., a minute balance, a byte balance, etc.), itis determined what inflection point (e.g., a boundary) is hit next foreach value. In some embodiments, there are more than one inflectionpoint that can be a next inflection point depending on the values andhow they progress or change. In some embodiments, the next inflectionpoint is predicted to come up in a certain amount of time. In someembodiments, the next inflection point is predicted to come up in acertain number of bytes transferred. In various embodiments, thenormalized inputs change as a function of time, dollars in an accountbalance, remaining minute balance, call minutes, bytes, or any otherappropriate parameter.

For example, time passing is simulated until the normalized input(s)change. Time passing is simulated by calculating new values for theinputs as they would change over time. For instance, the time input isupdated; account balance inputs are updated according to the chargingequation or equations; connection duration counter inputs are updated,etc. As the inputs are updated, the normalized inputs are recalculated,e.g., using input normalizer 400 of FIG. 4. Simulation of time passingcontinues until the calculation of the normalized inputs changescompared with the value calculated from the inputs received in 900. Thetime when the calculation of the normalized inputs changes is determinedto be the time to the next inflection point. In some embodiments, thenext inflection point is determined by simulating the number of bytestransferred.

In 904, a next inflection point is indicated. For example, the time orthe number of bytes transferred or a condition to the next inflectionpoint is reported. In various embodiments, the time or bytes or othercondition is reported back to the authorization or reauthorizationprocess, or any other appropriate information is reported back. In someembodiments, in 902, time passing is simulated until the time passes apredetermined duration (e.g., no more than 10 minutes of simulated timeare calculated). The time at the end of this duration is then reportedin 904 as the time to the next inflection point even if there is nochange in the normalized inputs at that point. In some embodiments, anumber of bytes are simulated as being transferred until the number ofbytes passes a predetermined quantity (e.g., no more than 10 Mbytes).The number of bytes at the end of this transfer is then reported as thecondition for the next inflection point even if there is no change inthe normalized inputs at that point.

FIG. 10 is a table illustrating an embodiment of a charge determination.In the example shown, balances are a United States (US) dollar balanceand include a peak minutes used balance, and an off-peak minutes usedbalance. The table example describes a phone call that begins at 4:40 PMand lasts for 45 minutes. At the state of call, the US dollar balance is85, the peak minutes used for current month is 90, and the off-peakminutes used balance used for current month is 80. The table has a toprow that has time values; the values are 4:40, 4:45, 4:50, 4;55, 5:00,5:05, 5:10, 5:15, 5:20, and 5:25. The table has a second row that hasrate values; the values are $0.00, $0.50, $0.50, $0.20, $0.20, $0.35,$0.35, $0.35, $0.35, and $0.10. The table has a third row that hasdiscount values; the values are 0%, −20%, −20%, −20%, −20%, −40%, −40%,−40%, −40%, and −40%. The table has a fourth row that has charge values;the values are $0.00, $2.50, $5.00, $6.00, $7.00, $8.75, $10.50, $12.25,$14.00, and $14.50. The table has a fifth row that has a discount of thecharge value. The discount of the charge values are $0.00, −$0.50,−$1.00, −$1.20, −$1.40, −$2.10, −$2.80, −$3.50, −$4.20, and −$4.40. Thetable has a sixth row that has a net cost value; the values are $0.00,$2.00, $4.00, $4.80, $5.60, $6.65, $7.70, $8.75, $9.80, and $10.10. Thetable has a seventh row that has a peak minute balance value; the valuesare 90, 95, 100, 105, 110, 110, 110, 110, 110, and 110. The table has aneighth row that has an off-peak minute balance value; the values are 80,80, 80, 80, 80, 85, 90, 95, 100, and 105. The table has a ninth row thathas US dollar balance values. The values are $85, $87, $89, $89.80,$90.60, $91.65, $92.70, $93.75. $94.80, and $95.10.

FIG. 11 is a graph illustrating an embodiment of a rating result. In theexample shown, the rating result graph is shown with a charge valuetrace (top trace), a discount of the charge value trace (bottom trace,negative values), and a net value trace (middle trace). The values shownare the values of table 10. The x-axis range shows time values 4:40through 5:25. The y-axis range shows values −$5.00 to $20.00.

FIG. 12 is a graph illustrating an embodiment of balance values. In theexample shown, the balance values graph is shown with a peak minutebalance value (top trace), a dollar balance (middle trace on the left ofthe graph for time values 4:40 through 5:10, and bottom trace for timevalues 5:15 through 5:25), and an off-peak minute balance value (bottomtrace on the left of the graph for time values 4:40 through 5:10, andmiddle trace for time values 5:15 through 5:25). The values shown arethe values of table 10. The x-axis range shows time values 4:40 through5:25. The y-axis range shows values 75 through 115.

Although the foregoing embodiments have been described in some detailfor purposes of clarity of understanding, the invention is not limitedto the details provided. There are many alternative ways of implementingthe invention. The disclosed embodiments are illustrative and notrestrictive.

What is claimed is:
 1. A system for determining a communication charge,comprising: a charging equation determiner for determining a chargingequation based at least in part on a normalized set of inputs; aninflection point determiner for determining an inflection point based atleast in part on a charging structure database; and a charge determinerfor determining a communication charge based at least in part on thecharging equation and the inflection point.